New Complexity Results for Classical Planning Benchmarks
نویسنده
چکیده
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains. Although they are commonly used for the purpose of evaluating planner performance, the planning domains themselves have not yet been studied in depth. In this contribution, we prove complexity results for the decision problems related to finding some plan, finding an optimal sequential plan, and finding an optimal parallel plan in these planning domains. Our results also provide some insights into the question why planning is hard for some of the domains under consideration.
منابع مشابه
A New Approach to Conformant Planning via Classical Planners
In this paper, we introduce a new approach to conformant planning via classical planners. We view a conformant planning problem as a set of classical planning problems, called sub-problems, and solve it using a generate-and-complete algorithm. Key to this algorithm is a procedure which takes a solution of a sub-problem and generates a solution for other sub-problems. We implement this algorithm...
متن کاملAproximation Properties of Planning Benchmarks
For many classical planning domains, the computational complexity of non-optimal and optimal planning is known. However, little is known about the area in between the two extremes of finding some plan and finding optimal plans. In this contribution, we provide a complete classification of the propositional domains from the first four International Planning Competitions with respect to the appro...
متن کاملConstruction of Benchmarks for Comparison of Grid Resource Planning Algorithms
The present contribution will focus on the systematic construction of benchmarks used for the evaluation of resource planning systems. Two characteristics for assessing the complexity of the benchmarks were developed. These benchmarks were used to evaluate the resource management system GORBA and the optimization strategies for resource planning applied in this system. At first, major aspects o...
متن کاملCompilation Based Approaches to Probabilistic Planning - Thesis Summary
Models of planning under uncertainty, and in particular, MDPs and POMDPs have received much attention in the AI and DecisionTheoretic planning communities (Boutilier, Dean, and Hanks 1999; Kaelbling, Littman, and Cassandra 1998). These models allow for a richer and more realistic representation of real-world planning problems, but lead to increased complexity. Recently, a new approach for handl...
متن کاملPlanning with Sensing: Scaling Up
We develop a domain-independent action selection mechanism for planning with sensing that does not build full contingent plans but just chooses the action to do next in a closedloop fashion. For this to work, the mechanism must be fast and informed. We take advantage of recent ideas that allow delete and precondition-free contingent problems to be converted into conformant problems, and conform...
متن کامل